Recognizing Hinge-free Line Graphs and Total Graphs
نویسندگان
چکیده
In this paper, we characterize line graphs and total graphs that are hinge-free, i.e., there is no triple of vertices x; y; z such that the distance between y and z increases after x is removed. Based on our characterizations, we show that given a graph G with n vertices and m edges, determining its line graph and total graph to be hinge-free can be solved in O(n + m) time. Moreover, characterizations of hinge-free iterated line graphs and total graphs are also discussed.
منابع مشابه
The Recognition of Geodetically Connected Graphs 1
Let G = (V;E) be a graph with vertex set V of size n and edge set E of size m. A vertex v 2 V is called a hinge vertex if the distance of any two vertices becomes longer after v is removed. A graph without hinge vertex is called a hingefree graph. In general, a graph G is k-geodetically connected or k-GC for short if G can tolerate any k 1 vertices failures without increasing the distance among...
متن کاملThe Recognition of Geodetically Connected Graphs
Let G = (V; E) be a graph with vertex set V of size n and edge set E of size m. A vertex v 2 V is called a hinge vertex if the distance of any two vertices becomes longer after v is removed. A graph without hinge vertex is called a hinge-free graph. In general, a graph G is k-geodetically connected or k-GC for short if G can tolerate any k ?1 vertices failures without increasing the distance am...
متن کاملZagreb Indices and Coindices of Total Graph, Semi-Total Point Graph and Semi-Total Line Graph of Subdivision Graphs
Expressions for the Zagreb indices and coindices of the total graph, semi-total point graph and of semi-total line graph of subdivision graphs in terms of the parameters of the parent graph are obtained, thus generalizing earlier existing results.
متن کاملNeighbourly Irregular Derived Graphs
A connected graph G is said to be neighbourly irregular graph if no two adjacent vertices of G have same degree. In this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.
متن کامل-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001